package dataStructure.tree;

//树的三种遍历

public class ThreeTraverse {
    public static void main(String[] args) {
//先需要创建一颗二叉树
        BinaryTree binaryTree = new BinaryTree();
//创建需要的结点
        HeroNode root = new HeroNode(1, "宋江");
        HeroNode node2 = new HeroNode(2, "吴用");
        HeroNode node3 = new HeroNode(3, "卢俊义");
        HeroNode node4 = new HeroNode(4, "林冲");
        HeroNode node5 = new HeroNode(5, "关胜");
        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        node3.setLeft(node5);
        binaryTree.setRoot(root);
//        //测试
//        System.out.println("前序遍历"); // 1,2,3,5,4
//        binaryTree.preOrder();
        //后序遍历查找
//后序遍历查找的次数 2 次
//        System.out.println("后序遍历方式~~~");
//        HeroNode resNode = binaryTree.postOrderSearch(5);
//        if (resNode != null) {
//
//            System.out.printf("找到了，信息为 no=%d name=%s", resNode.getNo(), resNode.getName());
//        } else {
//
//            System.out.printf("没有找到 no = %d 的英雄", 5);
//        }

        System.out.println("删除前");
        binaryTree.preOrder();
        binaryTree.delete(3);
        System.out.println("删除后");
        binaryTree.preOrder();


    }
}
//定义 BinaryTree 二叉树
class BinaryTree {
    private HeroNode root;

    public void setRoot(HeroNode root) {
        this.root = root;
    }
    //前序遍历
    public void preOrder() {
        if (root!=null){
            this.root.preOrder();
        }else {
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //中序遍历
    public void infixOrder() {
        if(this.root != null) {
            this.root.infixOrder();
        }else {
            System.out.println("二叉树为空，无法遍历");
        }

    }
    //后序遍历
    public void postOrder() {

        if(this.root != null) {
            this.root.postOrder();

        }else {
            System.out.println("二叉树为空，无法遍历");

        }
    }

    //前序遍历
    public HeroNode preOrderSearch(int no) {
            if (root!=null){
               return this.root.postOrderSearch(no);
            }else {
                return null;
            }

    }
    //中序遍历
    public HeroNode infixOrderSearch(int no) {
        if(root != null) {
            return root.infixOrderSearch(no);
        }else {
            return null;
        }

    }
    //后序遍历
    public HeroNode postOrderSearch(int no) {

        if(root != null) {
            return this.root.postOrderSearch(no);

        }else {
            return null;

        }
    }

    public void delete(int no){
        if (root==null){
            System.out.println("空树");
            return ;
        }
        if (root.getNo()==no){
            root=null;
            return ; //将二叉树置空
        }
       root.delete(no);

    }




}
class HeroNode {
    private int no;
    private String name;
    private HeroNode left;
    private HeroNode right;

    HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public HeroNode getLeft() {
        return left;
    }

    public void setLeft(HeroNode left) {
        this.left = left;
    }

    public HeroNode getRight() {
        return right;
    }

    public void setRight(HeroNode right) {
        this.right = right;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }

    //编写前序遍历的方法
    public void preOrder() {

        System.out.println(this); //先输出父结点

        //递归向左子树前序遍历
        if (this.left != null) {
            this.left.preOrder();
        }
        //递归向右子树前序遍历
        if (this.right != null) {
            this.right.preOrder();
        }
    }




    //中序遍历
    public void infixOrder() {

        if (this.left != null) {
            this.left.infixOrder();
        }
        //如果左子树为空，打印当前结点
        System.out.println(this);
        if (this.right != null) {
            this.right.infixOrder();
        }
    }

    //后序遍历
    public void postOrder() {
        if (this.left != null) {
            this.left.postOrder();
        }
        if (this.right != null) {
            this.right.postOrder();
        }
        //如果左右子树都为空，打印该结点
        System.out.println(this);
    }

    //前序遍历查找
    public HeroNode preOrderSearch(int no) {
        if (this.no == no) {
            return this;
        }
        HeroNode temp = null;
        if (this.left != null) {
            temp = this.left.preOrderSearch(no);
        }
        if (temp != null) {
            return temp;
        }
        if (this.right != null) {
            temp = this.right.preOrderSearch(no);
        }
        return temp;
    }

    //中序遍历查找
    public HeroNode infixOrderSearch(int no) {
        HeroNode temp = null;
        if (this.left != null) {
            temp = this.left.infixOrderSearch(no);
        }
        //走到这说明该结点没有左子树了
        if (temp != null) {
            return temp;
        }
        //走到这，说明该结点的左子树不是要查找的数据
        if (this.no == no) {
            return this;
        }
        if (this.right != null) {
            temp = this.right.infixOrderSearch(no);
        }
        return temp;
    }

    //后序遍历查找
    public HeroNode postOrderSearch(int no) {
        HeroNode temp = null;
        if (this.left!=null){
            temp = this.left.postOrderSearch(no);
        }
        if (temp!=null){//说明在左子树找到
            return temp;
        }
        if (this.right!=null){
            temp = this.right.preOrderSearch(no);
        }
        if (temp!=null){
            return temp;
        }
        if (this.no==no){
            return this;
        }
        //不存在
        return temp;
    }


    public void delete(int no) {
        if (this.left!=null&&this.left.no==no){
            this.left=null;
            return;
        }
        if (this.right!=null&&this.right.no==no){
            this.right = null;
            return;
        }
        //开始从左递归
        if (this.left!=null){
            this.left.delete(no);
        }

        if (this.right!=null){
            this.right.delete(no);
        }

    }
}